Particle swarm optimization for solving a scan-matching problem based on the normal distributions transform

نویسندگان

چکیده

In this paper, an evolutionary scan-matching approach is proposed to solve optimization issue in simultaneous localization and mapping (SLAM). A rich literature has been invested direction, however, most of the approaches lack fast convergence simplicity regarding process, which should directly affect accuracy environment’s map estimated pose. It a line research that always active, offering various solutions issue. Among many SLAM methods, normal distributions transform (NDT) shown high performances, where numerous works have published up date studies demonstrate its efficiency wrt other methods. Nevertheless, few interested The solution based on NDT using particle swarm (PSO) it dubbed NDT-PSO. main contribution pose estimation problem PSO iterative maps. performances NDT-PSO proven real experiments performed car-like mobile robot both static dynamic environments. tested for different sizes, results show 70 particles are more than enough find best while avoiding local minima even loop closing. algorithm also suitable time applications, with average runnnig $$145 \rm{ms}$$ iterations process. This value can be further reduced fewer iterations. evaluated methods widely used among operating system community outperforms these algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Particle Swarm Optimization Algorithm for a Supplier Clustering Problem

This paper presents a fuzzy decision-making approach to deal with a clustering supplier problem in a supply chain system. During recent years, determining suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions is usually complex and unstructured. In general, many quantitative and qualitative factors, such as quality, price, and fl...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Cat swarm optimization for solving the open shop scheduling problem

This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing applications. The cat swarm optimization algorithm was applied to solve some benchmark instances from the lit...

متن کامل

fuzzy particle swarm optimization algorithm for a supplier clustering problem

this paper presents a fuzzy decision-making approach to deal with a clustering supplier problem in a supply chain system. during recent years, determining suitable suppliers in the supply chain has become a key strategic consideration. however, the nature of these decisions is usually complex and unstructured. in general, many quantitative and qualitative factors, such as quality, price, and fl...

متن کامل

Solving a new bi-objective model for a cell formation problem considering labor allocation by multi-objective particle swarm optimization

Mathematical programming and artificial intelligence (AI) methods are known as the most effective and applicable procedures to form manufacturing cells in designing a cellular manufacturing system (CMS). In this paper, a bi-objective programming model is presented to consider the cell formation problem that is solved by a proposed multi-objective particle swarm optimization (MOPSO). The model c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Evolutionary Intelligence

سال: 2021

ISSN: ['1864-5909', '1864-5917']

DOI: https://doi.org/10.1007/s12065-020-00545-y